The FRAME Prior in Hidden Markov Random Field and Coupled Hidden Markov Modelling for TCA Image Analysis

نویسندگان

  • Katy Streso
  • Francesco Lagona
چکیده

Tooth Cementum Annulation (TCA) is an age estimation method carried out on thin cross sections of the root of the human tooth. Age is computed by adding the tooth eruption age to the count of annual incremental lines which are called tooth rings and appear in the cementum band. Algorithms to denoise and segment the digital image of the tooth section are considered a crucial step towards computer-assisted TCA. The approach in this paper relies on modelling the images as hidden Markov random fields and as coupled hidden Markov chains, where gray values are assumed to be pixelwise conditionally independent and normally distributed, given a hidden random field of labels. These unknown labels have to be estimated to segment the image. To account for long-range dependence among the observed values and for periodicity in the placement of tooth rings, the Gibbsian label distribution is specified by two different potential functions that incorporate macro-features of the TCA image, that is a FRAME model and a FRAME chain. An estimation of the model parameters is made by an EM algorithm exploiting the mean field approximation of the label distribution. Preprint submitted to Elsevier Science 31 March 2006 Segmentation is based on the predictive distribution of the labels given the observed gray values.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hidden Markov Random Field and Frame Modelling for TCA Image Analysis

Tooth Cementum Annulation (TCA) is an age estimation method carried out on thin cross sections of the root of the human tooth. Age is computed by adding the tooth eruption age to the count of annual incremental lines which are called tooth rings and appear in the cementum band. Algorithms to denoise and segment the digital image of the tooth section are considered a crucial step towards compute...

متن کامل

Automated Tumor Segmentation Based on Hidden Markov Classifier using Singular Value Decomposition Feature Extraction in Brain MR images

ntroduction: Diagnosing brain tumor is not always easy for doctors, and existence of an assistant that                                                      facilitates the interpretation process is an asset in the clinic. Computer vision techniques are devised to aid the clinic in detecting tumors based on a database of tumor c...

متن کامل

Generalised Mixture Estimation and Unsupervised Classification Based on Hidden Markov Chains and Hidden Markov Random Fields

Hidden Markov chain (HMC) models, applied to a HilbertPeano scan of the image, constitute a fast and robust alternative to hidden Markov random field (HMRF) models for spatial regularisation of image analysis problems, even though the latter provide a finer and more intuitive modelling of spatial relationships. In the framework of generalised mixture estimation and unsupervised classification o...

متن کامل

Intrusion Detection Using Evolutionary Hidden Markov Model

Intrusion detection systems are responsible for diagnosing and detecting any unauthorized use of the system, exploitation or destruction, which is able to prevent cyber-attacks using the network package analysis. one of the major challenges in the use of these tools is lack of educational patterns of attacks on the part of the engine analysis; engine failure that caused the complete training,  ...

متن کامل

Relative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain

 In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006